A covering system whose smallest modulus is 40
نویسندگان
چکیده
منابع مشابه
A covering system with least modulus 25
A collection of congruences with distinct moduli, each greater than 1, such that each integer satisfies at least one of the congruences, is said to be a covering system. A famous conjecture of Erdös from 1950 states that the least modulus of a covering system can be arbitrarily large. This conjecture remains open and, in its full strength, appears at present to be unattackable. Most of the effo...
متن کاملFinding a Covering Triangulation Whose Maximum Angle is Provably Small
We consider the following problem given a pla nar straight line graph nd a covering triangulation whose maximum angle is as small as possible A cov ering triangulation is a triangulation whose vertex set contains the input vertex set and whose edge set con tains the input edge set The covering triangulation problem di ers from the usual Steiner triangulation problem in that we may not add a ver...
متن کاملClique polynomials have a unique root of smallest modulus
Given an undirected graph G, let PG(z) be the polynomial PG(z) = ∑ n (−1)ncnz , where cn is the number of cliques of size n in G. We show that, for every G, the polynomial PG(z) has only one root of smallest modulus. Clique polynomials are related to trace monoids. Indeed, 1 PG(z) is the generating function of the sequence {tn}, where tn is the number of traces of size n in the trace monoid def...
متن کاملWhat is the Smallest Model of a System ?
How we represent systems is fundamental to the history of mathematics, science, and engineering. Recently, the minimality of that representation is of interest: Scientifically, because the size of its “minimal representation” is used to define a system’s complexity, and practically because the size and redundancy of engineering specifications challenge the effectiveness of real systems engineer...
متن کاملCharacterization and axiomatization of all semigroups whose square is group
In this paper we give a characterization for all semigroups whose square is a group. Moreover, we axiomatize such semigroups and study some relations between the class of these semigroups and Grouplikes,introduced by the author. Also, we observe that this paper characterizes and axiomatizes a class of Homogroups (semigroups containing an ideal subgroup). Finally, several equivalent conditions ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Number Theory
سال: 2009
ISSN: 0022-314X
DOI: 10.1016/j.jnt.2008.09.016